A new level-dependent coarsegrid correction scheme for indefinite Helmholtz problems

In this paper we construct and analyse a level-dependent coarsegrid correction scheme for indefinite Helmholtz problems. This adapted multigrid method is capable of solving the Helmholtz equation on the finest grid using a series of multigrid cycles with a grid-dependent complex shift, leading to a stable correction scheme on all levels. It is rigourously shown that the adaptation of the complex shift throughout the multigrid cycle maintains the functionality of the two-grid correction scheme, as no smooth modes are amplified in or added to the error. In addition, a sufficiently smoothing relaxation scheme should be applied to ensure damping of the oscillatory error components. Numerical experiments on various benchmark problems show the method to be competitive with or even outperform the current state-of-the-art multigrid-preconditioned Krylov methods, like e.g. CSL-preconditioned GMRES or BiCGStab.Comment: 21 page

Complex additive geometric multilevel solvers for Helmholtz equations on spacetrees

We introduce a family of implementations of low-order, additive, geometric multilevel solvers for systems of Helmholtz equations arising from Schrödinger equations. Both grid spacing and arithmetics may comprise complex numbers, and we thus can apply complex scaling to the indefinite Helmholtz operator. Our implementations are based on the notion of a spacetree and work exclusively with a finite number of precomputed local element matrices. They are globally matrix-free. Combining various relaxation factors with two grid transfer operators allows us to switch from additive multigrid over a hierarchical basis method into a Bramble-Pasciak-Xu (BPX)-type solver, with several multiscale smoothing variants within one code base. Pipelining allows us to realize full approximation storage (FAS) within the additive environment where, amortized, each grid vertex carrying degrees of freedom is read/written only once per iteration. The codes realize a single-touch policy. Among the features facilitated by matrix-free FAS is arbitrary dynamic mesh refinement (AMR) for all solver variants. AMR as an enabler for full multigrid (FMG) cycling—the grid unfolds throughout the computation—allows us to reduce the cost per unknown. The present work primary contributes toward software realization and design questions. Our experiments show that the consolidation of single-touch FAS, dynamic AMR, and vectorization-friendly, complex scaled, matrix-free FMG cycles delivers a mature implementation blueprint for solvers of Helmholtz equations in general. For this blueprint, we put particular emphasis on a strict implementation formalism as well as some implementation correctness proofs

On the indefinite Helmholtz equation: complex stretched absorbing boundary layers, iterative analysis, and preconditioning

This paper studies and analyzes a preconditioned Krylov solver for Helmholtz problems that are formulated with absorbing boundary layers based on complex coordinate stretching. The preconditioner problem is a Helmholtz problem where not only the coordinates in the absorbing layer have an imaginary part, but also the coordinates in the interior region. This results into a preconditioner problem that is invertible with a multigrid cycle. We give a numerical analysis based on the eigenvalues and evaluate the performance with several numerical experiments. The method is an alternative to the complex shifted Laplacian and it gives a comparable performance for the studied model problems

A preconditioned iterative solver for the scattering solutions of the Schrodinger equation

The Schr\"odinger equation defines the dynamics of quantum particles which has been an area of unabated interest in physics. We demonstrate how simple transformations of the Schr\"odinger equation leads to a coupled linear system, whereby each diagonal block is a high frequency Helmholtz problem. Based on this model, we derive indefinite Helmholtz model problems with strongly varying wavenumbers. We employ the iterative approach for their solution. In particular, we develop a preconditioner that has its spectrum restricted to a quadrant (of the complex plane) thereby making it easily invertible by multigrid methods with standard components. This multigrid preconditioner is used in conjuction with suitable Krylov-subspace methods for solving the indefinite Helmholtz model problems. The aim of this study is to report the feasbility of this preconditioner for the model problems. We compare this idea with the other prevalent preconditioning ideas, and discuss its merits. Results of numerical experiments are presented, which complement the proposed ideas, and show that this preconditioner may be used in an automatic setting.Comment: Accepted in Communications in Computational Physic